Impacts of logistics information on sales: Evidence from Alibaba

Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility-diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self-reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self-reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.     

滑模变结构控制的月球着陆舱姿态控制系统设计

在我国的探月计划中,要实现月球探测器软着陆于月球表面.在分析月球着陆舱软着陆段的飞行任务对于姿态控制要求的基础上,基于滑模变结构控制方法,根据实际姿态角和期望姿态角的偏差,给出了线性滑动模态面的切换方程,采用指数趋近律和边界层削抖的方法,推导出期望控制力矩的计算公式.并研究了姿控发动机的配置特点和点火逻辑.给出了由期望力矩计算实际控制力矩的方法.仿真结果表明,该姿态控制系统能迅速地将着陆舱跟踪到期望姿态.着陆舱经过514s飞行,在距月面2 km处将速度减为零,将姿态调整到垂直向下,完成了飞行任务.飞行轨迹比较平滑,具有较好的鲁棒性和自适应性.     

基于模糊自适应变维Kalman滤波器的跟踪算法(英文)

针对不同阶数的Kalman滤波器具有不同的跟踪能力与跟踪效率之间存在的矛盾,设计了一种模糊自适应变维跟踪算法(FAVD)。该算法使用两级滤波器,根据目标机动性的变化,适当地调整滤波器的阶数,使跟踪结果快速收敛,很好地解决了矛盾。同时通过模糊推理机制,在线调节高阶滤波器的参数,使适用范围大大增强,提高自适应能力,从而使该算法可以采用较少的模型覆盖较多的目标运动模式,达到很好的跟踪滤波效果,计算量也会大大减小。通过对计算机仿真结果分析表明,提出的算法具有可靠、计算简便、快速等特点,模型滤波精度较高,并可实现实时跟踪预测,具有一定的理论价值和实用价值。     

间歇采样转发假目标对CFAR检测影响分析

分析间歇采样转发形成的假目标干扰对雷达CFAR检测的影响和间歇采样转发假目标生成机理,给出间歇采样转发假目标产生方法。在此基础上,以雷达一次搜索周期内虚警、漏警造成的检测代价作为检测性能指标,分别分析单元平均恒虚警检测器、有序恒虚警检测器、剔除和平均恒虚警检测器在间歇采样转发假目标干扰下的检测代价。着重分析间歇采样转发干扰关键参数对检测代价的影响。仿真结果表明,间歇采样转发产生的多个假目标显著提高了雷达的检测代价,检测代价受转发占空比、转发功率的影响较大,而受转发频率影响较小。在三种恒虚警检测器的对比中,剔除和平均恒虚警检测器相对于另两种检测器的检测代价更大些。     

基于当前统计模型的有向图切换IMM算法

将当前统计模型和变结构多模型估计算法相结合,提出了一种新的用于跟踪机动目标的交互多模型算法,计算机仿真结果显示该算法能有效提高交互多模型估计器的费效比。     

装备维修中备件需求率的预计方法

通过研究装备维修过程中器件的固有可靠性和维修性,着重分析了影响维修器件需求率的主要因素.利用系统建模和仿真的方法,分别针对耗损类型器件和可修复类型器件建立了相应的需求数学模型,最后给出了维修备件需求率的预计方法.     

基于模型参考的SINS/GPS制导炸弹俯仰偏航控制

由于SINS/GPS制导炸弹俯仰偏航要进行大空域的机动飞行,导致了其作为被控对象的状态方程参数变化剧烈,就要求飞控系统具有更强的适应能力和鲁棒性.因此.设计了基于模型参考变结构控制方法的鲁棒自动驾驶仪,具有良好的瞬态性能和抗参数大范围变化能力强等优点.以某型SlNS/GPS制导炸弹为例.选取典型的气动恶劣条件,进行了按给定制导指令飞行的六自由度全弹道飞行控制仿真,仿真结果表明,该自动驾驶仪能对制导炸弹实现鲁棒自适应控制,为飞控系统设计提供了重要参考.     

箔条云干扰下的单目标恒虚警率检测研究

箔条云在扩散过程中随着时间变化会稀释和扩大,其回波特性会发生改变,被检测目标与箔条的相互位置关系也会影响雷达恒虚警检测。针对作战对抗过程中箔条干扰易造成雷达接收机阻塞干扰目标检测,检测概率迅速降低且易丢失目标贻误战机,通过详细分析箔条的扩散过程及信号频谱特性及其箔条云和目标的两种位置关系,利用恒虚警处理算法在噪声基底为10 dB和20 dB情况下对目标进行恒定虚警率检测研究。研究结果对改善飞机检测性能和抗虚警能力以及提高战场生存率具有积极作用。     

滑模控制的新型双幂次组合函数趋近律

提出一种基于双幂次组合函数趋近律的新型滑模控制方案。与现有的快速幂次或双幂次趋近律相比,具有更快的收敛速度,同时还保持了全局固定时间收敛特性,收敛时间上界与滑模初值无关。当系统存在有界扰动时,能够使滑模变量在有限时间内收敛到稳态误差界内,同时其稳态误差要小于现有方法的。仿真实验验证了该方法的有效性及理论分析的正确性。     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005